Synthesis for Logical Initializability of Synchronous Finite State Machines
نویسندگان
چکیده
A new method is introduced for the synthesis for logical initializability of synchronous state machines. The goal is to synthesize a gate-level implementation that is initializable when simulated by a 3-valued (0,1,X) simulator. The method builds on an existing approach of Cheng and Agrawal, which uses constrained state assignment to translate functional initializability into logical initializability. Here, a di erent state assignment method is proposed which, unlike the method of Cheng and Agrawal, is guaranteed safe and yet is not as conservative. Furthermore, it is demonstrated that certain new constraints on combinational logic synthesis are both necessary and su cient to insure that the resulting gate-level circuit is 3-valued simulatable. Interestingly, these constraints are similar to those used for hazard-free synthesis of asynchronous combinational circuits. Using the above constraints, we present a complete synthesis for initializability method, targeted to both two-level and multi-level circuits.
منابع مشابه
Synthesis-for-Initializability of Asynchronous Sequential Machines
We present a new method for the synthesis-forinitializability of asynchronous state machines. Unlike existing approaches, our method incorporates a state assignment step. State assignment is critical, since initializability may be precluded by poor choice of state assignment. Also, we present precise conditions on hazard-free logic, to insure that the circuits are physically initializable.
متن کاملState Assignment for Initializability of Synchronous Finite State Machines
It is well known that state encoding can in uence the logic initializability of an FSM implementation. If the sole objective of an \optimal" state assignment is to minimize the amount of logic, one may end up with implementations that are logically uninitializable. That is, a 3-valued (0,1,X) logic simulator may not be able to initialize the circuit even when its FSM has a synchronizing sequenc...
متن کاملOnline State Space Model Parameter Estimation in Synchronous Machines
The purpose of this paper is to present a new approach based on the Least Squares Error method for estimating the unknown parameters of the nonlinear 3rd order synchronous generator model. The proposed method uses the mathematical relationships between the machine parameters and on-line input/output measurements to estimate the parameters of the nonlinear state space model. The field voltage is...
متن کاملRestricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملMealy Finite State Machines: an Evolutionary Approach
Synchronous finite state machines are very important for digital sequential designs. Among other important aspects, they represent a powerful way for synchronising hardware components so that these components may cooperate adequately in the fulfillment of the main objective of the hardware design. In this paper, we propose an evolutionary methodology synthesis finite state machines. First, we o...
متن کامل